package org.huawei260.TiKu.ODsuanfa;

import java.util.Arrays;
import java.util.HashMap;
import java.util.Scanner;
public class E_2024E_2811__哈希表跳房子I {

//	public class Main {
		public static void main(String[] args) {
			Scanner sc = new Scanner(System.in);

			String tmp = sc.nextLine();
			int[] steps =
				Arrays.stream(tmp.substring(1, tmp.length() - 1).split(","))
					.mapToInt(Integer::parseInt)
					.toArray();

			int count = Integer.parseInt(sc.nextLine());

			System.out.println(getResult(steps, count));
		}

		public static String getResult(int[] steps, int count) {
			HashMap<Integer, Integer> map = new HashMap<>();

			int minIdxSum = Integer.MAX_VALUE;
			String ans = "";

			for (int idx1 = 0; idx1 < steps.length; idx1++) {
				int step1 = steps[idx1];
				int step2 = count - step1;

				if (map.containsKey(step2)) {
					int idx2 = map.get(step2);
					int idxSum = idx1 + idx2;
					if (idxSum < minIdxSum) {
						minIdxSum = idxSum;
						ans = "[" + step2 + "," + step1 + "]";
					}

				} else {
					map.putIfAbsent(step1, idx1);
				}
			}

			return ans;
		}
	}